منابع مشابه
Vertex-disjoint t-claws in graphs
Let δ(G) denote the minimum degree of a graph G. We prove that for t ≥ 4 and k ≥ 2, a graph G of order at least (t + 1)k + 11 6 t 2 with δ(G) ≥ k + t − 1 contains k pairwise vertex-disjoint copies of K1,t.
متن کاملForbidden Pairs for Vertex-Disjoint Claws
Let k ≥ 4, and let H1, H2 be connected graphs with |V (Hi)| ≥ 3 for i = 1, 2. A graph G is said to be {H1, . . . , Hl}-free if none of H1, . . . , Hl is an induced subgraph of G. We prove that if there exists a positive integer n0 such that every {H1, H2}-free graph G with |V (G)| ≥ n0 and δ(G) ≥ 3 contains k vertex-disjoint claws, then {H1, H2} ∩ {K1,t | t ≥ 2} = ∅. Also, we prove that every K...
متن کاملVertex-Disjoint Stars in Graphs
In this paper, we give a sufficient condition for a graph to contain vertex-disjoint stars of a given size. It is proved that if the minimum degree of the graph is at least k + t − 1 and the order is at least (t + 1)k + O(t), then the graph contains k vertex-disjoint copies of a star K1,t. The condition on the minimum degree is sharp, and there is an example showing that the term O(t) for the n...
متن کاملVertex Disjoint Paths in Upward Planar Graphs
The k-vertex disjoint paths problem is one of the most studied problems in algorithmic graph theory. In 1994, Schrijver proved that the problem can be solved in polynomial time for every fixed k when restricted to the class of planar digraphs and it was a long standing open question whether it is fixed-parameter tractable (with respect to parameter k) on this restricted class. Only recently, [1...
متن کاملVertex-disjoint copies of K4- in graphs
Let K− 4 denote the graph obtained from K4 by removing one edge. Let k be an integer with k ≥ 2. Kawarabayashi conjectured that if G is a graph of order n ≥ 4k + 1 with σ2(G) ≥ n + k, then G has k vertex-disjoint copies of K− 4 . In this paper, we settle this conjecture affirmatively.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete Mathematics
سال: 1999
ISSN: 0012-365X
DOI: 10.1016/s0012-365x(99)90069-9